Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
451	Special Issue on Artificial Intelligence Underpinning Golden Ball Algorithm for solving Flow Shop Scheduling Problem Fatima Sayoti, Mohammed Essaid Riffi LAROSERI Laboratory, Dept. of Computer Science, Faculty of Scienc Add to Reading List Source URL: www.ijimai.org Language: English - Date: 2016-03-29 07:56:34 Operations research Computational complexity theory Scheduling Mathematics Applied mathematics NP-hard problems Complexity classes Mathematical optimization Flow shop scheduling Makespan Combinatorial optimization Schedule
452	A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem∗ Dai Tri Man Lê1 , Stephen A. Cook2 , and Yuli Ye3 1 2 3 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-06-20 15:42:49
453	May 21, Spring 2008 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2009-05-07 21:17:22 Mathematics Graph theory Computational complexity theory Edsger W. Dijkstra B-tree Shortest path problem Big O notation Heap
454	Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits Yasin Abbasi-Yadkori Dept. of Computing Science University of Alberta Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2012-02-08 11:48:18 Econometrics Machine learning Statistical theory Probability distributions Online machine learning Loss function Big O notation Sample complexity Confidence interval Normal distribution Matrix Algorithm
455	On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2011-07-18 11:44:43 Combinatorial optimization Graph theory NP-complete problems Network theory Edsger W. Dijkstra Steiner tree problem Simplex Matching Bipartite graph Graph Shortest path problem A* search algorithm
456	Private Client-Side Profiling with Random Forests and Hidden Markov Models George Danezis1 , Markulf Kohlweiss1 , Benjamin Livshits1 , and Alfredo Rial2 1 2 Add to Reading List Source URL: www0.cs.ucl.ac.uk Language: English - Date: 2013-10-10 06:48:57 Public-key cryptography Cryptography Computational complexity theory Zero-knowledge proof Proof of knowledge IP Digital signature Commitment scheme NP Random oracle Mathematical proof Markov chain
457	December 15, Fall 2008 Final Examination Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2009-05-07 21:09:13 Graph theory Mathematics Computational complexity theory Network theory Spanning tree NP-complete problems Edsger W. Dijkstra Shortest path problem Longest path problem Minimum spanning tree Reverse-delete algorithm
458	LEARNING LARGE-ALPHABET AND ANALOG CIRCUITS WITH VALUE INJECTION QUERIES Dana Angluin1 James Aspnes1 Jiang Chen2 Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2010-09-09 14:03:20 Computational complexity theory Theory of computation Theoretical computer science Circuit complexity Complexity classes Clique problem Boolean circuit ACC0 Clique Circuit NC
459	Discrete Tabu Search for Graph Matching Kamil Adamczewski Yumin Suh Add to Reading List Source URL: www.cv-foundation.org Language: English - Date: 2015-10-24 14:55:30 Graph theory Mathematics Metaheuristics Operations research Combinatorial optimization Computational complexity theory Local search Tabu search Matching Mathematical optimization Heuristic Search algorithm
460	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-09-27 14:14:46 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity

UPDATE